TSTP Solution File: CSR136^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR136^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:37 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 18 ( 10 unt; 4 typ; 0 def)
% Number of atoms : 10 ( 1 equ; 0 cnn)
% Maximal formula atoms : 1 ( 0 avg)
% Number of connectives : 61 ( 13 ~; 4 |; 4 &; 40 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 ^ 12 !; 2 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
lBill_THFTYPE_i: $i ).
thf(decl_26,type,
lMary_THFTYPE_i: $i ).
thf(decl_27,type,
lSue_THFTYPE_i: $i ).
thf(decl_28,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(con,conjecture,
? [X1: $i > $i > $o] :
( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ),
file('/export/starexec/sandbox2/tmp/tmp.DhQchClO38/E---3.1_7672.p',con) ).
thf(ax_001,axiom,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.DhQchClO38/E---3.1_7672.p',ax_001) ).
thf(ax_002,axiom,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
file('/export/starexec/sandbox2/tmp/tmp.DhQchClO38/E---3.1_7672.p',ax_002) ).
thf(c_0_3,negated_conjecture,
~ ? [X1: $i > $i > $o] :
( ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X2: $i,X3: $i] : ( X1 @ X2 @ X3 ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_4,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(fof_simplification,[status(thm)],[ax_001]) ).
thf(c_0_5,negated_conjecture,
! [X7: $i > $i > $o,X8: $i,X9: $i] :
( ~ ( X7 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X7 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X7 @ X8 @ X9 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_6,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X3: $i,X2: $i,X1: $i > $i > $o] :
( ( X1 @ X2 @ X3 )
| ~ ( X1 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X1 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X2: $i] : ( lBill_THFTYPE_i = X2 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_7]) ).
thf(c_0_10,plain,
~ ( likes_THFTYPE_IiioI @ lBill_THFTYPE_i @ lBill_THFTYPE_i ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).
thf(c_0_11,plain,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(split_conjunct,[status(thm)],[ax_002]) ).
thf(c_0_12,negated_conjecture,
! [X2: $i] :
~ ( likes_THFTYPE_IiioI @ X2 @ X2 ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
thf(c_0_13,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_9]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR136^1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 15:15:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.47 Running higher-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.DhQchClO38/E---3.1_7672.p
% 0.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.48 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho4 with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho2 with 300s (1) cores
% 0.20/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.48 # Starting full_lambda_10 with 300s (1) cores
% 0.20/0.48 # Starting new_ho_8 with 300s (1) cores
% 0.20/0.48 # new_bool_9 with pid 7752 completed with status 0
% 0.20/0.48 # Result found by new_bool_9
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.48 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.20/0.48 # Search class: HHUNF-FFSF00-SSSFFSBN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 163s (1) cores
% 0.20/0.48 # ho_unfolding_3 with pid 7761 completed with status 0
% 0.20/0.48 # Result found by ho_unfolding_3
% 0.20/0.48 # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.20/0.48 # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting post_as_ho12 with 300s (1) cores
% 0.20/0.48 # Starting new_bool_9 with 300s (1) cores
% 0.20/0.48 # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.20/0.48 # Search class: HHUNF-FFSF00-SSSFFSBN
% 0.20/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 163s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 18
% 0.20/0.48 # Removed by relevancy pruning/SinE : 14
% 0.20/0.48 # Initial clauses : 4
% 0.20/0.48 # Removed in clause preprocessing : 0
% 0.20/0.48 # Initial clauses in saturation : 4
% 0.20/0.48 # Processed clauses : 17
% 0.20/0.48 # ...of these trivial : 0
% 0.20/0.48 # ...subsumed : 5
% 0.20/0.48 # ...remaining for further processing : 11
% 0.20/0.48 # Other redundant clauses eliminated : 0
% 0.20/0.48 # Clauses deleted for lack of memory : 0
% 0.20/0.48 # Backward-subsumed : 1
% 0.20/0.48 # Backward-rewritten : 4
% 0.20/0.48 # Generated clauses : 13
% 0.20/0.48 # ...of the previous two non-redundant : 17
% 0.20/0.48 # ...aggressively subsumed : 0
% 0.20/0.48 # Contextual simplify-reflections : 0
% 0.20/0.48 # Paramodulations : 7
% 0.20/0.48 # Factorizations : 0
% 0.20/0.48 # NegExts : 0
% 0.20/0.48 # Equation resolutions : 0
% 0.20/0.48 # Disequality decompositions : 0
% 0.20/0.48 # Total rewrite steps : 13
% 0.20/0.48 # ...of those cached : 10
% 0.20/0.48 # Propositional unsat checks : 0
% 0.20/0.48 # Propositional check models : 0
% 0.20/0.48 # Propositional check unsatisfiable : 0
% 0.20/0.48 # Propositional clauses : 0
% 0.20/0.48 # Propositional clauses after purity: 0
% 0.20/0.48 # Propositional unsat core size : 0
% 0.20/0.48 # Propositional preprocessing time : 0.000
% 0.20/0.48 # Propositional encoding time : 0.000
% 0.20/0.48 # Propositional solver time : 0.000
% 0.20/0.48 # Success case prop preproc time : 0.000
% 0.20/0.48 # Success case prop encoding time : 0.000
% 0.20/0.48 # Success case prop solver time : 0.000
% 0.20/0.48 # Current number of processed clauses : 2
% 0.20/0.48 # Positive orientable unit clauses : 0
% 0.20/0.48 # Positive unorientable unit clauses: 1
% 0.20/0.48 # Negative unit clauses : 1
% 0.20/0.48 # Non-unit-clauses : 0
% 0.20/0.48 # Current number of unprocessed clauses: 5
% 0.20/0.48 # ...number of literals in the above : 7
% 0.20/0.48 # Current number of archived formulas : 0
% 0.20/0.48 # Current number of archived clauses : 9
% 0.20/0.48 # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48 # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48 # Non-unit clause-clause subsumptions : 0
% 0.20/0.48 # Unit Clause-clause subsumption calls : 1
% 0.20/0.48 # Rewrite failures with RHS unbound : 0
% 0.20/0.48 # BW rewrite match attempts : 11
% 0.20/0.48 # BW rewrite match successes : 4
% 0.20/0.48 # Condensation attempts : 17
% 0.20/0.48 # Condensation successes : 0
% 0.20/0.48 # Termbank termtop insertions : 419
% 0.20/0.48 # Search garbage collected termcells : 62
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.003 s
% 0.20/0.48 # System time : 0.002 s
% 0.20/0.48 # Total time : 0.005 s
% 0.20/0.48 # Maximum resident set size: 1784 pages
% 0.20/0.48
% 0.20/0.48 # -------------------------------------------------
% 0.20/0.48 # User time : 0.004 s
% 0.20/0.48 # System time : 0.004 s
% 0.20/0.48 # Total time : 0.008 s
% 0.20/0.48 # Maximum resident set size: 1720 pages
% 0.20/0.48 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------